<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode&lt; KType &gt; Struct Template Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#pub-types">Public Types</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode&lt; KType &gt; Struct Template Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>BinaryTreeNode：二叉树的节点，算法导论xx章xx节  
 <a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>&gt;</code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:adbd8539e7a907c3a8fe7a8b79e7032e8"><td class="memItemLeft" align="right" valign="top">typedef KType&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a></td></tr>
<tr class="separator:adbd8539e7a907c3a8fe7a8b79e7032e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a8e8de673785852b0c091916f5fb64e78"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8e8de673785852b0c091916f5fb64e78">BinaryTreeNode</a> ()</td></tr>
<tr class="memdesc:a8e8de673785852b0c091916f5fb64e78"><td class="mdescLeft">&#160;</td><td class="mdescRight">默认构造函数  <a href="#a8e8de673785852b0c091916f5fb64e78">More...</a><br /></td></tr>
<tr class="separator:a8e8de673785852b0c091916f5fb64e78"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8382a5ddc6f9c8cbfeacd0f0163d8c4d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a8382a5ddc6f9c8cbfeacd0f0163d8c4d">BinaryTreeNode</a> (const <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a> &amp;keyvalue)</td></tr>
<tr class="memdesc:a8382a5ddc6f9c8cbfeacd0f0163d8c4d"><td class="mdescLeft">&#160;</td><td class="mdescRight">显式构造函数  <a href="#a8382a5ddc6f9c8cbfeacd0f0163d8c4d">More...</a><br /></td></tr>
<tr class="separator:a8382a5ddc6f9c8cbfeacd0f0163d8c4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae552fb23243e499a60ef73375fabe239"><td class="memItemLeft" align="right" valign="top">virtual std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#ae552fb23243e499a60ef73375fabe239">to_string</a> ()</td></tr>
<tr class="memdesc:ae552fb23243e499a60ef73375fabe239"><td class="mdescLeft">&#160;</td><td class="mdescRight">to_string:返回该节点的字符串描述  <a href="#ae552fb23243e499a60ef73375fabe239">More...</a><br /></td></tr>
<tr class="separator:ae552fb23243e499a60ef73375fabe239"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a694d14f0b33f2f052f11148ecbe1684e"><td class="memItemLeft" align="right" valign="top">virtual std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a694d14f0b33f2f052f11148ecbe1684e">to_xml</a> ()</td></tr>
<tr class="memdesc:a694d14f0b33f2f052f11148ecbe1684e"><td class="mdescLeft">&#160;</td><td class="mdescRight">to_xml:返回以该节点为根的子树的<code>xml</code>描述。  <a href="#a694d14f0b33f2f052f11148ecbe1684e">More...</a><br /></td></tr>
<tr class="separator:a694d14f0b33f2f052f11148ecbe1684e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a54a90606ceb604a1a4d01056429a8a06"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a54a90606ceb604a1a4d01056429a8a06">is_left_child</a> ()</td></tr>
<tr class="memdesc:a54a90606ceb604a1a4d01056429a8a06"><td class="mdescLeft">&#160;</td><td class="mdescRight">is_left_child:判断本节点是否左子节点。  <a href="#a54a90606ceb604a1a4d01056429a8a06">More...</a><br /></td></tr>
<tr class="separator:a54a90606ceb604a1a4d01056429a8a06"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a34c1912a2a7e9caa7a67354218fd7640"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a34c1912a2a7e9caa7a67354218fd7640">is_right_child</a> ()</td></tr>
<tr class="memdesc:a34c1912a2a7e9caa7a67354218fd7640"><td class="mdescLeft">&#160;</td><td class="mdescRight">is_right_child:判断本节点是否右子节点。  <a href="#a34c1912a2a7e9caa7a67354218fd7640">More...</a><br /></td></tr>
<tr class="separator:a34c1912a2a7e9caa7a67354218fd7640"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:aa94cbc785416ba74505661baac55a9fd"><td class="memItemLeft" align="right" valign="top">std::weak_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aa94cbc785416ba74505661baac55a9fd">parent</a></td></tr>
<tr class="separator:aa94cbc785416ba74505661baac55a9fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3e056b1d34820497ac3a23a16180be2b"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#a3e056b1d34820497ac3a23a16180be2b">lchild</a></td></tr>
<tr class="separator:a3e056b1d34820497ac3a23a16180be2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaccc444db582ed362bff4e50efbc47c7"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#aaccc444db582ed362bff4e50efbc47c7">rchild</a></td></tr>
<tr class="separator:aaccc444db582ed362bff4e50efbc47c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af3cb8030ab05ccaf1a69a86c9f468b8d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#af3cb8030ab05ccaf1a69a86c9f468b8d">key</a></td></tr>
<tr class="separator:af3cb8030ab05ccaf1a69a86c9f468b8d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;typename KType&gt;<br />
struct IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode&lt; KType &gt;</h3>

<p>BinaryTreeNode：二叉树的节点，算法导论xx章xx节 </p>
<p>任何一个节点都有两个强引用指向左右子节点，以及一个弱引用指向它的父节点。节点还有一个<code>key</code>成员包含具体的数据 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00031">31</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>
</div><h2 class="groupheader">Member Typedef Documentation</h2>
<a class="anchor" id="adbd8539e7a907c3a8fe7a8b79e7032e8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">typedef KType <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>节点保存的数据的类型 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00034">34</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="a8e8de673785852b0c091916f5fb64e78"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a> </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>默认构造函数 </p>
<p>所有的成员变量都采取默认值 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00039">39</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="a8382a5ddc6f9c8cbfeacd0f0163d8c4d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::<a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a> </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a> &amp;&#160;</td>
          <td class="paramname"><em>keyvalue</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>显式构造函数 </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">keyvalue:节点要保存的数据内容</td><td>指定<code>key</code>成员需要赋值的数据 </td></tr>
  </table>
  </dd>
</dl>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00048">48</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="a54a90606ceb604a1a4d01056429a8a06"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::is_left_child </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>is_left_child:判断本节点是否左子节点。 </p>
<dl class="section return"><dt>Returns</dt><dd>返回<code>true</code>或者<code>false</code> 该函数判断本节点是否是左子节点。如果本节点的父节点为空，则返回<code>false</code>；如果本节点的父节点非空且本节点是父节点的左子节点，则返回<code>true</code>；否则返回<code>false</code> </dd></dl>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00099">99</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="a34c1912a2a7e9caa7a67354218fd7640"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::is_right_child </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>is_right_child:判断本节点是否右子节点。 </p>
<dl class="section return"><dt>Returns</dt><dd>返回<code>true</code>或者<code>false</code> 该函数判断本节点是否是右子节点。如果本节点的父节点为空，则返回<code>false</code>；如果本节点的父节点非空且本节点是父节点的右子节点，则返回<code>true</code>；否则返回<code>false</code> </dd></dl>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00113">113</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="ae552fb23243e499a60ef73375fabe239"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual std::string <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::to_string </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>to_string:返回该节点的字符串描述 </p>
<dl class="section return"><dt>Returns</dt><dd>: 本节点的描述字符串</dd></dl>
<p>该函数打印本节点的<code>key</code>，以及父节点（若存在）、子节点（若存在）的<code>key</code> </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00058">58</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="a694d14f0b33f2f052f11148ecbe1684e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual std::string <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::to_xml </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>to_xml:返回以该节点为根的子树的<code>xml</code>描述。 </p>
<dl class="section return"><dt>Returns</dt><dd>: 本节点子树的<code>xml</code>描述的字符串</dd></dl>
<p>该函数返回以本节点为根的子树的<code>xml</code>描述。对子节点递归调用从而生成<code>xml</code>数据 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00079">79</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a class="anchor" id="af3cb8030ab05ccaf1a69a86c9f468b8d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html#adbd8539e7a907c3a8fe7a8b79e7032e8">KeyType</a> <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::key</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>节点的保存的数据 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00125">125</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="a3e056b1d34820497ac3a23a16180be2b"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::shared_ptr&lt;<a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt; <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::lchild</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>节点的左子节点的强引用 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00123">123</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="aa94cbc785416ba74505661baac55a9fd"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::weak_ptr&lt;<a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt; <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::parent</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>节点的父节点的弱引用 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00122">122</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<a class="anchor" id="aaccc444db582ed362bff4e50efbc47c7"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename KType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::shared_ptr&lt;<a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a>&gt; <a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>&lt; KType &gt;::rchild</td>
        </tr>
      </table>
</div><div class="memdoc">
<p>节点的右子节点的强引用 </p>

<p>Definition at line <a class="el" href="binarytreenode_8h_source.html#l00124">124</a> of file <a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a>.</p>

</div>
</div>
<hr/>The documentation for this struct was generated from the following file:<ul>
<li>src/tree_algorithms/binarytreenode/<a class="el" href="binarytreenode_8h_source.html">binarytreenode.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></li><li class="navelem"><a class="el" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html">TreeAlgorithm</a></li><li class="navelem"><a class="el" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
